Axiomatizations for downward XPath on data trees
نویسندگان
چکیده
منابع مشابه
Axiomatizations for downward XPath on Data Trees
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, and containing the single ‘child’ axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access th...
متن کاملDefinability for Downward and Vertical XPath on Data Trees
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation ...
متن کاملComplete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downward single axis fragments of Core XPath (that is, Core XPath(↓) and Core XPath(↓)) as well as the full Core XPath. We make use of techniques from modal logic. XPath is a language for navigating through XML documents. In ...
متن کاملSaturation, Definability, and Separation for XPath on Data Trees
We study the expressive power of some fragments of XPath equipped with (in)equality tests over data trees. Our main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of node expressions, and our separation theorems, which give sufficient conditions under which two disjoint classes of...
متن کاملBasic Model Theory of XPath on Data Trees
We investigate model theoretic properties of XPath with data (in)equality tests over the class of data trees, i.e., the class of trees where each node contains a label from a finite alphabet and a data value from an infinite domain. We provide notions of (bi)simulations for XPath logics containing the child, descendant, parent and ancestor axes to navigate the tree. We show that these notions p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.05.008